Search results for "Code reuse"
showing 5 items of 5 documents
A Case Study on Agriture: Distributed HLA-Based Architecture for Agricultural Robotics
2011
In agricultural robotics, as in other robotic systems, one of the most important parts is the control architecture. This paper describes the definition of a new control architecture specially designed for groups of robots in charge of doing maintenance tasks in agricultural environments. This architecture has been developed having in mind principles as scalability, code reuse, abstraction hardware and data distribution. Moreover, it is important that the control architecture can allow coordination and cooperation among the different elements in the system. The architecture presented in this paper implements all these concepts by means of the integration of different systems, such as Player,…
A New HLA-Based Distributed Control Architecture for Agricultural Teams of Robots in Hybrid Applications with Real and Simulated Devices or Environme…
2011
The control architecture is one of the most important part of agricultural robotics and other robotic systems. Furthermore its importance increases when the system involves a group of heterogeneous robots that should cooperate to achieve a global goal. A new control architecture is introduced in this paper for groups of robots in charge of doing maintenance tasks in agricultural environments. Some important features such as scalability, code reuse, hardware abstraction and data distribution have been considered in the design of the new architecture. Furthermore, coordination and cooperation among the different elements in the system is allowed in the proposed control system. By integrating …
A study on graph representations for genetic programming
2020
Graph representations promise several desirable properties for Genetic Programming (GP); multiple-output programs, natural representations of code reuse and, in many cases, an innate mechanism for neutral drift. Each graph GP technique provides a program representation, genetic operators and overarching evolutionary algorithm. This makes it difficult to identify the individual causes of empirical differences, both between these methods and in comparison to traditional GP. In this work, we empirically study the behavior of Cartesian Genetic Programming (CGP), Linear Genetic Programming (LGP), Evolving Graphs by Graph Programming (EGGP) and traditional GP. By fixing some aspects of the config…
IN service specification using the KANNEL language
1995
KANNEL is an application-oriented language for protocol engineering, with integrated support for all the main aspects of implementing typical communications software. Intelligent network services with distributed and interacting components share a number of central features with communications protocols, thus bringing in the possibility of applying protocol engineering techniques within the area of intelligent networking. To verify this view, the KANNEL language is applied to the specification of an intelligent calling card service. The specification includes both visual and textual notations of KANNEL.
Multithreaded Translation of Ptolemy II Designs on Multicore Platforms
2008
Ptolemy II is an open source environment for system design and test based on component data flow. This paradigm tries to make parallel systems more deterministic and understandable. In this work we propose a technique to translate designs developed with Ptolemy II, into multithreaded Java implementations on multicore platforms. We have chosen Java mainly because Ptolemy II is implemented in Java and then we get direct code reuse. The counterpart is a certain amount of overhead that we expect to be less relevant as Java runtime environment will evolve. The main goals are to produce efficient parallel simulators and software devices with competitive performance level. We show by means of an e…